Termination w.r.t. Q of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(x, 0) → s(0)
f(s(x), s(y)) → s(f(x, y))
g(0, x) → g(f(x, x), x)
Q is empty.
↳ QTRS
↳ AAECC Innermost
Q restricted rewrite system:
The TRS R consists of the following rules:
f(x, 0) → s(0)
f(s(x), s(y)) → s(f(x, y))
g(0, x) → g(f(x, x), x)
Q is empty.
We have applied [19,8] to switch to innermost. The TRS R 1 is
f(x, 0) → s(0)
f(s(x), s(y)) → s(f(x, y))
The TRS R 2 is
g(0, x) → g(f(x, x), x)
The signature Sigma is {g}
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
Q restricted rewrite system:
The TRS R consists of the following rules:
f(x, 0) → s(0)
f(s(x), s(y)) → s(f(x, y))
g(0, x) → g(f(x, x), x)
The set Q consists of the following terms:
f(x0, 0)
f(s(x0), s(x1))
g(0, x0)
Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:
G(0, x) → F(x, x)
G(0, x) → G(f(x, x), x)
F(s(x), s(y)) → F(x, y)
The TRS R consists of the following rules:
f(x, 0) → s(0)
f(s(x), s(y)) → s(f(x, y))
g(0, x) → g(f(x, x), x)
The set Q consists of the following terms:
f(x0, 0)
f(s(x0), s(x1))
g(0, x0)
We have to consider all minimal (P,Q,R)-chains.
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
Q DP problem:
The TRS P consists of the following rules:
G(0, x) → F(x, x)
G(0, x) → G(f(x, x), x)
F(s(x), s(y)) → F(x, y)
The TRS R consists of the following rules:
f(x, 0) → s(0)
f(s(x), s(y)) → s(f(x, y))
g(0, x) → g(f(x, x), x)
The set Q consists of the following terms:
f(x0, 0)
f(s(x0), s(x1))
g(0, x0)
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 2 less nodes.
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ UsableRulesProof
Q DP problem:
The TRS P consists of the following rules:
F(s(x), s(y)) → F(x, y)
The TRS R consists of the following rules:
f(x, 0) → s(0)
f(s(x), s(y)) → s(f(x, y))
g(0, x) → g(f(x, x), x)
The set Q consists of the following terms:
f(x0, 0)
f(s(x0), s(x1))
g(0, x0)
We have to consider all minimal (P,Q,R)-chains.
As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [15] we can delete all non-usable rules [17] from R.
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
Q DP problem:
The TRS P consists of the following rules:
F(s(x), s(y)) → F(x, y)
R is empty.
The set Q consists of the following terms:
f(x0, 0)
f(s(x0), s(x1))
g(0, x0)
We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.
f(x0, 0)
f(s(x0), s(x1))
g(0, x0)
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ QDPSizeChangeProof
Q DP problem:
The TRS P consists of the following rules:
F(s(x), s(y)) → F(x, y)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- F(s(x), s(y)) → F(x, y)
The graph contains the following edges 1 > 1, 2 > 2